Efficient emulators for scattering using eigenvector continuation
نویسندگان
چکیده
منابع مشابه
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
Miller et al. [MPVX15] devised a distributed1 algorithm in the CONGEST model, that given a parameter k = 1, 2, . . ., constructs an O(k)-spanner of an input unweighted n-vertex graph with O(n) expected edges in O(k) rounds of communication. In this paper we improve the result of [MPVX15], by showing a k-round distributed algorithm in the same model, that constructs a (2k − 1)spanner with O(n/ǫ)...
متن کاملEfficient coordinate-wise leading eigenvector computation
We develop and analyze efficient ”coordinatewise” methods for finding the leading eigenvector, where each step involves only a vector-vector product. We establish global convergence with overall runtime guarantees that are at least as good as Lanczos’s method and dominate it for slowly decaying spectrum. Our methods are based on combining a shift-and-invert approach with coordinate-wise algorit...
متن کاملAn efficient eigenvector approach for finding netlist partitions
A fast eigenvector technique for obtaining good initial node partitions of netlists for use in interchange heuristics is described. The method is based on approximating the netlist or hypergraph by a weighted graph, G, such that the sum of the cut edges in G tightly underestimates the number of cut nets in any netlist partition. An eigenvector technique of Barnes [2] is used to partition the gr...
متن کاملEfficient Algorithms for Large-scale Generalized Eigenvector Computation and CCA
Moreover, it is well known that any method which starts at m and iteratively applies M to linear combinations of the points computed so far must apply M at least Ω( √ κ(B)) in order to halve the error in the standard norm for the problem (Shewchuk, 1994). Consequently, methods that solve the top-1 generalized eigenvector problem by simply applying A and B, which is the same as applying M and ta...
متن کاملEfficient Protocols for Principal Eigenvector Computation over Private Data
In this paper we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy constraints. Our proposed protocol is based on secure multi-party computation with a semi-honest arbitrator who deals with data encrypted by the other parties using an additive homomorphic cryptosystem. We augment the protocol with r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2020
ISSN: 0370-2693
DOI: 10.1016/j.physletb.2020.135719